翻訳と辞書 Words near each other ・ Oddvar Vormeland ・ Oddvar Wenner Nilssen ・ Oddvard Nilsen ・ Oddville, Kentucky ・ Oddville, MTV ・ Oddvør Johansen ・ Oddworld ・ Oddworld Inhabitants ・ Oddy test ・ Oddz and Enz ・ Oddz N Endz ・ Oddzar ・ Oddział, Masovian Voivodeship ・ Oddziały ・ Odd–even rationing ・ Odd–even sort ・ ODE ・ Ode ・ Ode (album) ・ Ode (ballet) ・ Ode (disambiguation) ・ Ode (poem) ・ Ode Burrell ・ Ode for St. Cecilia's Day (Handel) ・ Ode for the Birthday of Queen Anne ・ Ode Fulutudilu ・ Ode Music ・ Ode of Remembrance ・ Ode Ogede ・ Ode Ojowu Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Odd–even sort ： ウィキペディア英語版 Odd–even sort In computing, an odd–even sort or odd–even transposition sort (also known as brick sort) is a relatively simple sorting algorithm, developed originally for use on parallel processors with local interconnections. It is a comparison sort related to bubble sort, with which it shares many characteristics. It functions by comparing all odd/even indexed pairs of adjacent elements in the list and, if a pair is in the wrong order (the first is larger than the second) the elements are switched. The next step repeats this for even/odd indexed pairs (of adjacent elements). Then it alternates between odd/even and even/odd steps until the list is sorted. ==Sorting on processor arrays== On parallel processors, with one value per processor and only local left–right neighbor connections, the processors all concurrently do a compare–exchange operation with their neighbors, alternating between odd–even and even–odd pairings. This algorithm was originally presented, and shown to be efficient on such processors, by Habermann in 1972.〔N. Haberman (1972) "Parallel Neighbor Sort (or the Glory of the Induction Principle)," CMU Computer Science Report (available as Technical report AD-759 248, National Technical Information Service, US Department of Commerce, 5285 Port Royal Rd Sprigfield VA 22151).〕 The algorithm extends efficiently to the case of multiple items per processor. In the Baudet–Stevenson odd–even merge-splitting algorithm, each processor sorts its own sublist at each step, using any efficient sort algorithm, and then performs a merge splitting, or transposition–merge, operation with its neighbor, with neighbor pairing alternating between odd–even and even–odd on each step.〔 〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Odd–even sort」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.